Almost tight upper bounds for lower envelopes in higher dimensions
نویسندگان
چکیده
منابع مشابه
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions
We show that the combinatorial complexity of the lower envelope of n surfaces or surface patches in dspace ( d 2 3), all algebraic of constant maximum degree, and bounded by algebraic surfaces of constant maximum degree, is O(rkl+') , for any E > 0; the constant of proportionality depends on E , d, and the shape and degree of the surface patches and of their boundaries. This is the first nontri...
متن کاملMinimum Fill-In: Inapproximability and Almost Tight Lower Bounds
Given an n× n sparse symmetric matrix with m nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values. To maintain the matrix sparse, we would like to minimize the number k of these changes, hence called the minimum fill-in problem. Agrawal, Klein, and Ravi [FOCS 1990; Graph Theory & Sparse Matrix Comp. 1993] developed the first approximation algorithm for the p...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملLower Bounds and Upper Bounds for MaxSAT
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1994
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02574384